An interactive programme for Steiner trees
نویسندگان
چکیده
We introduce a fully written programmed code with a supervised method for generating Steiner trees. Our choice of the programming language, and the use of well-known theorems from Geometry and Complex Analysis, allowed this method to be implemented with only 747 lines of effective source code. This eases the understanding and the handling of this beta version for future developments.
منابع مشابه
Stree: An Interactive Program for Weighted Steiner Trees
Here we present the extended version of a previous short publication about stree, which is a fully written program with a semi-automatic method that generates weighted Steiner trees. Our choice of the programming language, and the use of well-known theorems from Geometry and Complex Analysis, allowed this method to be implemented with only 764 lines of effective source code. This simplifies the...
متن کاملRectilinear Trees under Rotation and Related Problems
We onsider the problem of nding a minimum spanning tree for a set of points in the plane where the orientations of edges are restri ted to uniformly distributed orientations, = 2; 3; 4; : : :, and where the oordinate system an be rotated around the origo by an arbitrary angle. The most important ase with appli ations in VLSI design arises when = 2; in this, soalled re tilinear ase, the edges ha...
متن کاملStatistical Alignment via k-Restricted Steiner Trees
When relating a set of sequences by a phylogeny, we are essentially constructing a Steiner tree connecting the sequences in the space of all finite sequences. Finding an optimal Steiner tree is in most formulations hard, so population genetics and phylogenetics have often used spanning trees as an approximation for computational expediency. In this assessment you will be asked to investigate an...
متن کاملSteiner trees and spanning trees in six-pin soap films
Abstract We have studied the Steiner tree problem using six-pin soap films in detail. We extend the existing method of experimental realisation of Steiner trees in n-terminal problem through soap films to observe new non-minimal Steiner trees. We also produced spanning tree configurations for the first time by our method. Experimentally, by varying the pin diameter, we have achieved these new s...
متن کاملSteiner Trees with Degree Constraints: Structural Results and an Exact Solution Approach
In this paper we study the Steiner tree problem with degree constraints. Motivated by an application in computational biology we first focus on binary Steiner trees in which all node degrees are required to be at most three. We then present results for general degree-constrained Steiner trees. It is shown that finding a binary Steiner is NP-complete for arbitrary graphs. We relate the problem t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1210.7788 شماره
صفحات -
تاریخ انتشار 2012